Mathematical Curiosities Alfred S. Posamentier and Ingmar Lehmann Prometheus Books, 2014, ISBN4 The authors are well known as mathematical expositors, and produce about a book a year. This is their 2014

Source URL: www.austms.org.au

• Mathematics
• Academia
• Mathematics education
• Mental calculators
• Philosophy of mathematics
• Number theory
• Mathematician
• Pure mathematics
• Mathematical proof
• Paul Erds
• Srinivasa Ramanujan
• Prime number

Elicitable distortion risk measures: a concise proof Ruodu Wang∗ and Johanna F. Ziegel† February 4, 2015 Abstract Elicitability has recently been discussed as a desirable property for risk

Source URL: sas.uwaterloo.ca

• Mathematical analysis
• Mathematics
• Spectral theory
• Actuarial science
• Coherent risk measure
• Financial risk
• Mathematical finance
• RadonNikodym theorem
• Distribution
• Spectral theory of ordinary differential equations
• Decomposition of spectrum

Probabilistic Algorithms and Ramsey-Type Principles in Reverse Mathematics Laurent Bienvenu Ludovic Patey

Source URL: ludovicpatey.com

• Mathematics
• Logic
• Proof theory
• Mathematical proofs
• Lemma
• Theorem
• Abstraction
• Reverse mathematics
• BPP

On strong standard completeness of MTLQ ∗ expansions Amanda Vidal1 , Lluis Godo1 , and Francesc Esteva1 Artificial Intelligence Research Institute (IIIA - CSIC), Spain, [amanda][godo][esteva]@iiia.csic.es

Source URL: logica.dmi.unisa.it

• Fuzzy logic
• Mathematical logic
• Model theory
• Metalogic
• Proof theory
• Monoidal t-norm logic
• BL
• ukasiewicz logic
• First-order logic
• Completeness
• Axiom
• Metamathematics

Formal proof sketches Freek Wiedijk University of Nijmegen Abstract. We define the notion of formal proof sketch for the mathematical language Mizar. We show by examples that formal proof sketches are very close to infor

Source URL: www.cs.ru.nl

Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

Source URL: vigna.di.unimi.it

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP-complete problems
• Mathematical optimization
• NP-hard problems
• MAX-3SAT
• NP
• Approximation algorithm
• Probabilistically checkable proof
• PCP theorem
• APX

MUltlog and MUltseq Reanimated and Married M. Baaz1 C.G. Ferm¨ uller1 1

Source URL: www.preining.info

• Proof theory
• Sequent calculus
• Sequent
• First-order logic
• Propositional calculus
• Intuitionistic logic
• Many-valued logic
• Cut-elimination theorem
• Method of analytic tableaux
• Mathematical logic
• Rule of inference
• Boolean algebra

Recent Developments in ΩMEGA’s Proof Search Programming Language Serge Autexier Dominik Dietrich

Source URL: dream.inf.ed.ac.uk

• Logic
• Proof theory
• Formal systems
• Logical truth
• Syntax
• Proof assistants
• Mathematical proof
• Logic programming
• Sequent
• KeY
• Rule of inference
• Inference

Telling cause from effect in deterministic linear dynamical systems Supplementary Material We have prepared an appendix to address the proofs for Proposition 3, Theorems 1 and 2 which we provide in the following sections

Source URL: jmlr.org

• Mathematical analysis
• Mathematics
• Analysis
• Operator theory
• Algebra of random variables
• Covariance
• Covariance and correlation
• Variance
• Monotone convergence theorem
• Pi
• Harmonic analysis
• Proof that is irrational

Private Client-Side Profiling with Random Forests and Hidden Markov Models George Danezis1 , Markulf Kohlweiss1 , Benjamin Livshits1 , and Alfredo Rial2 1 2

Source URL: www0.cs.ucl.ac.uk

• Public-key cryptography
• Cryptography
• Computational complexity theory
• Zero-knowledge proof
• Proof of knowledge
• IP
• Digital signature
• Commitment scheme
• NP
• Random oracle
• Mathematical proof
• Markov chain